HOR 2004 2 nd International Workshop on Higher - Order Rewriting
نویسندگان
چکیده
Natural intersection type preorders are the type structures which agree with the plain intuition of intersection type constructor as set-theoretic intersection operation and arrow type constructor as set-theoretic function space constructor. In this paper we study the relation between natural intersection type preorders and natural λ-structures, i.e. ω-algebraic lattices D with Galois connections given by F : D → [D → D] and G : [D → D] → D. We prove on one hand that natural intersection type preorders induces natural λ-structures, on the other hand that natural λ-structures admits presentations through intersection type preorders. Moreover we give a concise presentations of classical D∞ λ-models of untyped λ-calculus through suitable natural intersection type preorders and prove that filter λ-models induced by them are isomorphic to D∞.
منابع مشابه
HOR 2014 7 th International Workshop on Higher - Order Rewriting 8 . 45
We show that Jay and Kesners dynamic pattern calculus can be embedded into a higher-order pattern rewriting systems in the sense of Nipkow. Metatheoretical results, such as confluence and standardisation, are obtained for the dynamic pattern calculus as a consequence of this embedding. The embedding also opens a way to study the semantics of Jays programming language bondi based on pattern matc...
متن کاملHOR 2012 6th International Workshop on Higher-Order Rewriting
The aim of HOR is to provide an informal forum to discuss all aspects of higher-order rewriting. The topics of the workshop include applications, foundations, frameworks, implementations , and semantics. HOR is a biannual meeting. The present volume provides final versions of six accepted contributed extended abstracts of talks selected for the workshop. HOR 2012 had also a tool session. The fo...
متن کاملModularity of Strong Normalization and Confluence in the algebraic-lambda-Cube
elimination des coupures dans l'arithm etique d'ordre sup erieur. 24] Mitsuhiro Okada. Strong normalizability for the combined system of the types lambda calculus and an arbitrary convergent term rewrite system. higher order rules ((rst order rules are simply required to be non-duplicating). Connuence and strong normalization are essential properties of logical systems, since they ensure the co...
متن کاملHigher-order Rewriting for Executable Compiler Specifications
In this paper we outline how a simple compiler can be completely specified using higher order rewriting in all stages: parsing, analysis/optimization, and code emission, specifically using the crsx.sf.net system for a small declarative language called " X " inspired by XQuery (for which we are building a production quality compiler in the same way).
متن کاملWST ’ 04 7 th International Workshop on Termination
Partial Evaluation for Termination Analysis . . . . . . . . . . . . . . . . . . . . . 47 Lior Tamary, Michael Codish Relative Termination in Term Rewriting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 Hans Zantema
متن کامل